hdu 3605(二分图的多重匹配 |
您所在的位置：网站首页 › fit to live in › hdu 3605(二分图的多重匹配 |
|
一开始以为这题是二分图的匹配，然后用匈牙利做，TLE，然后用HK 做， TLE。。。 最后发现是用网络流做的，而且要将100000个点压缩， 因为每个点的可能选择情况有2^10 ，所以根据这个可以将图压缩成1000*10大小的图，这样用网络流就没有压力了... 网络流建模很重要.! Escape Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2483 Accepted Submission(s): 687 Problem Description 2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the planet. Now scientists want your help, is to determine what all of people can live in these planets.Input More set of test data, the beginning of each data is n (1 |
今日新闻 |
推荐新闻 |
| CopyRight 2018-2019 办公设备维修网 版权所有 豫ICP备15022753号-3 |